Evidential Decision Tree Based on Belief Entropy
نویسندگان
چکیده
منابع مشابه
A New Evidential Distance Measure Based on Belief Intervals
So far, most of the evidential distance and similarity measures proposed in the DempsterShafer theory literature have been based on the basic belief assignment function, so as the belief and plausibility functions as two main results of the theory are not directly used in this regard. In this paper, a new evidential distance measure is proposed based on these functions according to nearest neig...
متن کاملEvidential Markov Decision Processes
This paper proposes a new model, the EMDP (Evidential Markov Decision Process). It is a MDP (Markov Decision Process) for belief functions in which rewards are defined for each state transition, like in a classical MDP, whereas the transitions are modeled as in an EMC (Evidential Markov Chain), i.e. they are sets transitions instead of states transitions. The EMDP can fit to more applications t...
متن کاملEvidential Reasoning with Conditional Belief Functions
In the existing evidential networks with belief functions, the relations among the variables are always represented by joint belief functions on the product space of the involved variables. In this paper, we use conditional belief functions to represent such relations in the network and show some relations of these two kinds of representations. We also present a propagation algorithm for such n...
متن کاملConflict management based on belief function entropy in sensor fusion
Wireless sensor network plays an important role in intelligent navigation. It incorporates a group of sensors to overcome the limitation of single detection system. Dempster-Shafer evidence theory can combine the sensor data of the wireless sensor network by data fusion, which contributes to the improvement of accuracy and reliability of the detection system. However, due to different sources o...
متن کاملBelief Function Propagation in Directed Evidential Networks
In this paper, we propose a computational data structure based on the binary join tree where the independence relations of the original directed evidential networks (DEVN) are maintained. The proposed solution uses disjunctive rule of combination (DRC) and generalized Bayesian theorem (GBT), which make possible the use of the conditional belief functions directly for reasoning in the DEVN.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2019
ISSN: 1099-4300
DOI: 10.3390/e21090897